Growing perfect cubes
نویسندگان
چکیده
An (n, a, b)-perfect double cube is a b × b × b sized n-ary periodic array containing all possible a × a × a sized n-ary array exactly once as subarray. A growing cube is an array whose cj × cj × cj sized prefix is an (nj, a, cj)-perfect double cube for j = 1, 2, . . ., where cj = n v/3 j , v = a 3 and n1 < n2 < · · ·. We construct the smallest possible perfect double cube (a 256×256×256 sized 8-ary array) and growing cubes for any a.
منابع مشابه
The (non-)existence of perfect codes in Lucas cubes
A Fibonacci string of length $n$ is a binary string $b = b_1b_2ldots b_n$ in which for every $1 leq i < n$, $b_icdot b_{i+1} = 0$. In other words, a Fibonacci string is a binary string without 11 as a substring. Similarly, a Lucas string is a Fibonacci string $b_1b_2ldots b_n$ that $b_1cdot b_n = 0$. For a natural number $ngeq1$, a Fibonacci cube of dimension $n$ is denoted by $Gamma_n$ and i...
متن کاملSuper Strongly Perfect Ness of Some Interconnection Networks
A Graph G is Super Strongly Perfect Graph if every induced sub graph H of G possesses a minimal dominating set that meets all the maximal complete sub graphs of H. In this paper we have analyzed the structure of super strongly perfect graphs in some Interconnection Networks, like Mesh, Torus, Hyper cubes and Grid Networks. Along with this investigation, we have characterized the Super Strongly ...
متن کاملPerfect Powers That Are Sums of Consecutive Cubes
Euler noted the relation 63= 33+43+53 and asked for other instances of cubes that are sums of consecutive cubes. Similar problems have been studied by Cunningham, Catalan, Gennochi, Lucas, Pagliani, Cassels, Uchiyama, Stroeker and Zhongfeng Zhang. In particular, Stroeker determined all squares that can be written as a sum of at most 50 consecutive cubes. We generalize Stroeker’s work by determi...
متن کاملOn Perfect Domination of q-Ary Cubes
The construction of perfect dominating sets in all binary 2-cubes (r > 3) with the same number of edges along each coordinate direction is performed, thus generalizing the known construction of this for r = 3. However, an adaptation of that construction aiming to perfect dominating sets in the 14-ternary cube with edges along all coordinate directions still fails. 1 Perfect Dominating Sets in B...
متن کاملFibonacci Cubes Are the Resonance Graphs of Fibonaccenes
Fibonacci cubes were introduced in 1993 and intensively studied afterwards. This paper adds the following theorem to these studies: Fibonacci cubes are precisely the resonance graphs of fibonaccenes. Here fibonaccenes are graphs that appear in chemical graph theory and resonance graphs reflect the structure of their perfect matchings. Some consequences of the main result are also listed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008